System and method for crest factor reduction

ABSTRACT

A crest reduction system and method. The inventive system includes a first circuit for suppressing peak amplitudes of an input signal and providing a peak amplitude suppressed signal in response thereto and a second circuit coupled to the first circuit for rejecting intermodulation distortion in the amplitude suppressed signal. In the illustrative implementation, the first circuit is a peak amplitude suppressor having circuitry for computing an amplitude of the input signal and for computing a gain factor for the input signal in response thereto. In the best mode, the gain factor is obtained from a lookup table. The peak amplitude suppressor further includes a multiplier for applying the gain factor to the input signal. In the illustrative embodiment, the second circuit includes a plurality of bandpass filters and a summer for combining the outputs thereof.

CROSS-REFERENCE TO RELATED APPLICATION

This application claims the benefit of U.S. Provisional Application No. 60/616,716, filed Oct. 7, 2004, the disclosure of which is incorporated herein by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to electrical and electronic circuits and systems. More specifically, the present invention relates to systems and methods for reducing crest factor in electrical and electronic circuits and systems.

2. Description of the Related Art

In Multi-Carrier Power Amplifier (MCPA) communication transmission applications, multiple carriers are typically combined in the baseband, intermediate frequency (IF) or radio frequency (RF) frequency range and the resulting signal is transmitted using a single power amplifier. An objective for MCPA transmission is to transmit a signal at a very high efficiency while maintaining a low Adjacent Channel Power Ratio (ACPR) to meet spectral mask requirements. ACPR is defined as the ratio of power in a bandwidth away from the main signal (the distortion product) to the power in a bandwidth within the main signal. The bandwidths and locations are functions of the standards being employed.

To achieve high efficiency power amplifier (PA) transmission, it is desirable to use semi-non-linear PAs, such as Class A/B PAs. A challenge for MCPA signal transmission is due to the fact that the combined signal has a high crest factor (ratio of peak power to average power), where the peak power is significantly higher than the average power. A small portion of the combined signal can have very high peaks and when transmitted at high PA efficiency, these high-level signals reach into the saturated region of the PA's transfer function and the output of the PA has high intermodulation distortion (IMD). The high IMD level raises the ACPR levels.

To maintain low ACPR without any linearization techniques, the transmit signal level must be decreased sufficiently so that the peak amplitudes are not in the saturated zone of the PA, but this reduces the amplifier efficiency. For example, a four carrier W-CDMA (wideband code division multiple access) signal can have a crest factor exceeding 13 dB. If the crest factor is reduced by about 6 dB, the average power can be increased by 6 dB thus increasing the power efficiency by a factor of 4.

One conventional approach to this problem is to limit the amplitude of either the baseband signal or the RF signal output of each channel using a look-ahead approach. However, it is difficult to generate signals with low crest factor and low ACPR inasmuch as limiting the amplitude increases out of band emissions (e.g. sidelobes) and thereby raises the ACPR level. While, efforts to reduce the ACPR levels generally increase crest factor.

Another prior approach involves the use of unused CDMA codes to reduce the crest factor in the output signals. However, this approach requires knowledge of what is being transmitted so that the unused codes can be identified. This adds to the complexity, storage requirements and cost of the system.

Hence, a need remains in the art for an improved system or method for reducing the crest factor in communications systems while maintaining a low ACPR therefor.

SUMMARY OF THE INVENTION

The need in the art is addressed by the crest reduction system and method of the present invention. In a most general embodiment, the inventive system includes a first circuit for suppressing peak amplitudes of an input signal and providing a peak amplitude suppressed signal in response thereto and a second circuit coupled to the first circuit for rejecting intermodulation distortion in the amplitude suppressed signal.

In the illustrative implementation, the first circuit is a peak amplitude suppressor having circuitry for computing an amplitude of the input signal and for computing a gain factor for the input signal in response thereto. In the best mode, the gain factor is obtained from a lookup table. The peak amplitude suppressor further includes a multiplier for applying the gain factor to the input signal.

In the illustrative embodiment, the second circuit includes a plurality of bandpass filters and a summer for combining the outputs thereof. As an alternative, the second circuit is implemented with a plurality of finite impulse response (FIR) filters. The outputs of the FIR filters are Fast Fourier Transformed and predetermined bands of the output of the FFT are selected and combined to provide a crest factor reduced output signal.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a simplified block diagram of an illustrative implementation of a system for crest factor reduction in accordance with the teachings of the present invention;

FIG. 2 is a simplified block diagram showing an illustrative implementation of the peak amplitude suppressor of the crest reduction system of the present invention;

FIG. 3 is a series of graphs that illustrate the operation of the present invention. FIG. 3(A) shows the typical output of an amplitude suppressor;

FIG. 3(B) shows an illustrative passband of the intermodulation reject filter of FIG. 1;

FIG. 3(C) shows an illustrative output of the intermodulation reject filter of FIG. 1;

FIG. 4 is a simplified block diagram of an illustrative implementation of the IMD reject filter of FIG. 1;

FIG. 5(A) shows the spectrum shape of the input of the alternative embodiment of the IMD reject filter, which contains the desired signals to be transmitted and the IMD components that are generated by the peak amplitude suppressor;

FIG. 5(B) shows signal bands D₁, D₂, . . . D_(N) corresponding to IMD signals;

FIG. 5(C) shows the resulting spectrum of the output signal after the output of the amplitude suppressor is passed though the filter of FIG. 6;

FIG. 6 shows an alternative embodiment of the IMD reject filter of FIG. 1;

FIG. 7 is a simplified block diagram of an alternative illustrative polyphase implementation of the IMD reject filter in accordance with the present teachings;

FIG. 8 is a series of graphs designed to illustrate the operation of the filter of FIG. 7;

FIG. 9 is a simplified block diagram of an alternative illustrative polyphase implementation of the IMD reject filter in accordance with the present teachings;

FIG. 10 is a series of graphs designed to illustrate the operation of the filter of FIG. 9;

FIG. 11 illustrates passbands filtering in accordance with the present teachings;

FIG. 12 illustrates notchbands filtering in accordance with the present teachings;

FIG. 13 is an illustrative implementation of a single Multi bands and Arbitrary Shape Filter that support multiple bandpass signals for even length filter; and

FIG. 14 is an illustrative implementation of a single Multi bands and Arbitrary Shape Filter that support multiple bandpass signals for odd length filter.

DESCRIPTION OF THE INVENTION

Illustrative embodiments and exemplary applications will now be described with reference to the accompanying drawings to disclose the advantageous teachings of the present invention.

While the present invention is described herein with reference to illustrative embodiments for particular applications, it should be understood that the invention is not limited thereto. Those having ordinary skill in the art and access to the teachings provided herein will recognize additional modifications, applications, and embodiments within the scope thereof and additional fields in which the present invention would be of significant utility.

FIG. 1 is a simplified block diagram of an illustrative implementation of a system for crest factor reduction in accordance with the teachings of the present invention. The system 10 includes a peak amplitude suppressor 20 and an intermodulation rejection filter 30. A baseband, IF or RF input signal may be expressed as: X ₁(n)=I ₁(n)+jQ ₁(n)  [1] The signal X(n) is amplitude clipped by the suppressor 20. The phase is maintained to minimize the signal distortion in the following manner: X(n)=X(n); if A(n)<T  [2] X(n)=X(n)T/A(n); if A(n)≧T  [3] where A(n)=|X(n)| is the instantaneous amplitude of the signal X(n), and T is the amplitude threshold of the clipping.

FIG. 2 is a simplified block diagram showing an illustrative implementation of the peak amplitude suppressor of the crest reduction system of the present invention. The in-phase and quadrature components of the input are used to compute the amplitude via an amplitude detector 22. In practice, the amplitude detector 22 may be implemented with cordic I/Q to amplitude processing.

The detected amplitude is then fed to a gain factor generator 24. In the best mode, the gain factor generator 24 is implemented with a lookup table (LUT). The LUT 24 stores the T/A(t) gain values. The gain is then applied by first and second multipliers 12 and 14, respectively, to the original signal delayed by first and second delayed elements 26 and 28 respectively. The delay is used to match the delay amount occurring in the amplitude and LUT processing so that the gain is applied to the inputs from which it was computed. This process can be applied at IF or RF where the signal amplitude can be estimated via envelope detection.

After processing by the peak amplitude suppressor 20, the amplitude of the input signal will have a lower crest factor. However, inter-modulation distortion (IMD) is often generated. This is illustrated in FIG. 3.

FIG. 3 is a series of graphs that illustrate the operation of the present invention. FIG. 3(A) shows the typical output of an amplitude suppressor with the desired signals shown at 33 and IMD shown at 35. FIG. 3(B) shows an illustrative passband 37 of the intermodulation reject filter 30 of FIG. 1. FIG. 3(C) shows an illustrative output of the intermodulation reject filter 30 of FIG. 1. To suppress the IMD, the desired signals filter 30 selects the desired signal band or bands and performs signal filtering of these bands only: the desired signal bands are passed while the intermodulation components are attenuated. In this process, the intermodulation products are suppressed with the filter sidelobes, resulting in a high ACPR signal. FIG. 3(A) shows the spectrum shape of the signal input to the Inter-Modulation Reject Filter 30, which contains the desired signals to be transmitted and the IMD components that are generated by the Peak Amplitude Suppressor 20. FIG. 3(B) shows the desired signal bands S₁, S₂, . . . , S_(N) corresponding to the desired signal. After passing though a filter with the characteristic shown in FIG. 3(B), an output signal is provided with a spectrum illustrated in FIG. 3(C).

In accordance with the present teachings, at least two approaches can be used to suppress IMD. A first approach, as illustrated in FIG. 4, is to select the desired signal components. A second approach, illustrated in FIGS. 5 and 6 is to reject the undesirable IMD components per se.

FIG. 4 is a simplified block diagram of an illustrative implementation of the IMD reject filter 30 of FIG. 1. In this embodiment, the reject filter 30 consists of plural passband filters, e.g. 32, 34 and 36, followed by a summer 44. Each filter 32, 34 and 36 and its associated delay 38, 40 and 42 can be expressed as a Finite Impulse Response (FIR) filter as follows:

$\begin{matrix} {{S_{1}\text{:}\mspace{14mu} h_{S\; 1}} = {\sum\limits_{k = 0}^{{K\; 1} - 1}{h_{{S\; 1},k}z^{- k}}}} & \lbrack 4\rbrack \\ {{S_{2}\text{:}\mspace{14mu} h_{S\; 2}} = {\sum\limits_{k = 0}^{{K\; 2} - 1}{h_{{S\; 2},k}z^{- k}}}} & \lbrack 5\rbrack \\ {{S_{N}\text{:}\mspace{14mu} h_{SN}} = {\sum\limits_{k = 0}^{{KN} - 1}{h_{{S\; 1},k}z^{- k}}}} & \lbrack 6\rbrack \end{matrix}$ The resulting filter is then expressed as

$\begin{matrix} {{S_{1} + S_{2} + \ldots + {S_{N}:h}} = {{\sum\limits_{k = 0}^{{K\; 1} - 1}{h_{{S\; 1},k}z^{- k}}} + {\sum\limits_{k = 0}^{{K\; 2} - 1}{h_{{S\; 2},k}z^{- k}}} + \ldots + {\sum\limits_{k = 0}^{{KN} - 1}{h_{{SN},k}z^{- k}}}}} & \lbrack 7\rbrack \end{matrix}$ which is a single FIR filter. The filter components at each delay can be combined to provide the following filter structure:

$\begin{matrix} {{S_{1} + S_{2} + \ldots + {S_{N}:\left\{ h \right\}}} = {\sum\limits_{k = 0}^{\max{({{{K\; 1} - 1},\;{{K\; 2} - 1},\;\ldots\mspace{11mu},{{KN} - 1}})}}{h_{k}z^{- h}}}} & \lbrack 8\rbrack \end{matrix}$ This implies that the reject filter 30 (S₁+S₂+ . . . +S_(N)) can be implemented with a single FIR filter.

One way to use this approach is to design a filter for a single carrier, a filter for two adjacent channels, a filter for three adjacent channels, and a filter for four adjacent channels, etc. For a system using equal spaced channel centers, all possible patterns of signals is realizable by frequency shifting and adding this set of filters. In the best mode, the filter coefficients are combined and used as one FIR filter. For two adjacent channels, better performance is achieved when using a filter which is flat across both spectrums as opposed to using two filters designed for a single carrier.

As noted above, the filter of FIG. 4 is based on a desired signals approach. The alternative rejection approach for the filter 30 is illustrated in FIGS. 5 and 6. Similar to the desired signals filter method, the rejection filter 30′ performs the filtering of the IMD components and removes the distortion from the original signal.

In this embodiment, to suppress IMD, the filter 30′ selects the IMD signal bands and performs signal filtering of these bands only. In this process only the intermodulation products are selected, which are removed from the input signal so that the desired signal is left intact and the IMD is suppressed. FIG. 5(A) shows the spectrum shape of the input of the alternative embodiment of the IMD reject filter, which contains the desired signals to be transmitted and the IMD components that are generated by the peak amplitude suppressor. FIG. 5(B) shows signal bands D₁, D₂, . . . D_(N) corresponding to the IMD signals. FIG. 5(C) shows the resulting spectrum of the output signal after the output of the amplitude suppressor 20 is passed though the filter 30′ of FIG. 6.

FIG. 6 shows an alternative embodiment of the IMD reject filter of FIG. 1. The rejection filter 30′ includes plural filters of which three are shown 32′, 34′ . . . 36′. Again, in the best mode, the filter coefficients are combined and used as one FIR filter. The filters are designed to pass the IMD in the reject bands D₁, D₂ . . . D_(M) respectively. The outputs of the filters are delayed by associated delay elements 38′, 40′ . . . 42′ and subtracted from a delayed version of the input signal by a subtractor 44′. The input signal is delayed by element 46′. Those skilled in the art will appreciate that the embodiments of FIGS. 1, 4 and 6 may be implemented in software in which case the components shown are implemented in process steps.

In any event, each filter and its associated delay can be expressed as a Finite Impulse Response (FIR) filter as follows:

$\begin{matrix} {{S_{1}\text{:}\mspace{14mu} h_{S}} = z^{- {kS}}} & \lbrack 9\rbrack \\ {{D_{1}\text{:}\mspace{14mu} h_{D\; 1}} = {\sum\limits_{k = 0}^{{K\; 1} - 1}{h_{{D\; 1},k}z^{- k}}}} & \lbrack 10\rbrack \\ {{D_{2}\text{:}\mspace{14mu} h_{D\; 2}} = {\sum\limits_{k = 0}^{{K\; 2} - 1}{h_{{D\; 2},k}z^{- k}}}} & \lbrack 11\rbrack \\ {{D_{M}\text{:}\mspace{14mu} h_{DM}} = {\sum\limits_{k = 0}^{{KM} - 1}{h_{{D\; 1},k}z^{- k}}}} & \lbrack 12\rbrack \end{matrix}$ The resulting filter is then expressed as

$\begin{matrix} {{S + D_{1} + D_{2} + \ldots + {D_{N}\text{:}\mspace{14mu} h_{S\; 1}}} = {Z^{- {kS}} - {\sum\limits_{k = 10}^{{K\; 1} - 1}{h_{{D\; 1},k}z^{- k}}} - {\sum\limits_{k = 0}^{{K\; 2} - 1}{h_{{D\; 2},k}z^{- k}}} - \ldots - {\sum\limits_{k = 0}^{{KM} - 1}{h_{{DM},k}z^{- k}}}}} & \lbrack 13\rbrack \end{matrix}$ which is a single FIR filter. The filter components at each delay can be combined to provide the following filter structure:

$\begin{matrix} {{S + D_{1} + D_{2} + \ldots + {D_{N}\text{:}\mspace{14mu}\left\{ h \right\}}} = {\sum\limits_{h = 0}^{\max{({{{K\; 1} - 1},\;{{K\; 2} - 1},\;\ldots\mspace{11mu},{{KM} - 1}})}}{h_{k}z^{- h}}}} & \lbrack 14\rbrack \end{matrix}$ This implies that the reject (S−D₁−D₂− . . . −D_(M)) can be implemented with a single FIR filter.

The advantage of this approach is that the filter does not distort the desired signal. Only the intermodulation products are suppressed. Furthermore, because the power of the intermodulation is substantially small compared to the desired signal, the filter does not change the crest factor substantially.

In applications where the signals are equally spaced, a polyphase approach can be used to either select desired signals or reject IMD products.

FIG. 7 is a simplified block diagram of an alternative illustrative polyphase implementation of the IMD reject filter in accordance with the present teachings. This filter rejects IMD products by selecting desired signals.

FIG. 8 is a series of graphs designed to illustrate the operation of the filter 50 of FIG. 7. As per FIGS. 3 and 5 above, the first graph (FIG. 8(A)) shows the input to the filter, the second graph (FIG. 8(B)) shows the characteristic of the filter 50 and the third graph (FIG. 8(C)) shows the output of the filter.

In the implementation of FIG. 7, the output of the peak amplitude suppressor 20 of FIG. 1 is divided into an integer multiple, H, of equal-sized frequency slots by resampler 52 when doing an H-point FFT in the polyphase implementation for H=2^(x). For H not a power of two, a DFT can be used. The width of these slots is such that only signal energy or IMD energy is present in each slot. Each slot is filtered by a FIR filter 54, 56, 58 and 60 to pass the component in that frequency slot and to reject all other frequency components. Thus, by correctly choosing frequency slots, B_(h), that contain only signal energy, the signals S_(n) can be chosen such that the signal I₃+jQ₃ contains only signal energy, with the intermodulation components rejected. This selection is effected after a Fast Fourier Transform (via FFT 62) by a filter 64. The selected outputs of the filter 64 are then combined via summer 66.

FIG. 9 is a simplified block diagram of an alternative illustrative polyphase implementation of the IMD reject filter in accordance with the present teachings. This filter rejects IMD products output by the peak amplitude detector. The embodiment of FIG. 9 is similar to that of FIG. 7 with the exception that the filters are designed to pass the IMD products and the output of the summer 66 is subtracted from a delayed version of the input signal by a subtractor 68′.

FIG. 10 is a series of graphs designed to illustrate the operation of the filter 50′ of FIG. 9. As per FIGS. 3 and 5, the first graph (FIG. 9(A)) shows the input to the filter, the second graph (FIG. 9(B)) shows the characteristic of the filter 50′ and the third graph (FIG. 9(C)) shows the output of the filter.

In the polyphase distortion filter approach of FIG. 9, the spectrum, shown in FIG. 10, of the output of the peak amplitude suppressor is divided into an integer multiple, H, of equal-sized frequency slots. Each slot is filtered to pass the component in that frequency slot and to reject all other frequency components. The width of these slots is such that only signal energy or IMD energy is present in each slot. Thus, by correctly choosing frequency slots, B_(h), that contain only IMD energy, the intermodulation distortion components, D_(n), of FIG. 9 can be chosen such that the signal I₃+jQ₃ contains only distortion energy, with the desired signal components rejected. The final output of the filter 52′ is the difference between the input signal I₂+jQ₂, properly delayed, and the sum of signals, D_(n). This signal contains only signal energy with the distortion removed.

A multibands and arbitrary shape filter can be implemented in passbands mode where the desired bands are selected and the undesired bands such as intermodulation distortion (IMD) bands are removed.

FIG. 11 illustrates passbands filtering in accordance with the present teachings. The objective is to select the desired signal by forming the combined filtering of these desired signals. FIG. 11(A) shows the input signal; FIG. 11(B) shows the spectral characteristic of a passband filter; and FIG. 11(C) shows the output filtered signal.

The transmit signal can be a combination of multiple carriers at arbitrary frequencies, and thus the spectrum can be asymmetric. In these applications multiple bandpass filters can be designed, follow by a filter combination process to realize the combined filter with a single filter. Let I_(i)(n)+jQ_(i)(n) be the input signal of the filter. The output of the filter can be expressed as I _(o)(n)+jQ _(o)(n)={I _(i)(n)+jQ _(i)(n)}*g(n)  [15] where g(n) is the composite filter. We can expand g(n) and rewrite the equation as

$\begin{matrix} {{{I_{o}(n)} + {j\;{Q_{o}(n)}}} = {\left\{ {{I_{i}(n)} + {j\;{Q_{i}(n)}}} \right\}*\left\{ {{{h_{1}(n)} \cdot {\mathbb{e}}^{j\;\omega_{1}n}} + {{h_{2}(n)} \cdot {\mathbb{e}}^{{j\omega}_{2}n}} + \ldots + {{h_{N}(n)} \cdot {\mathbb{e}}^{{j\omega}_{N}n}}} \right\}}} & \lbrack 16\rbrack \\ {= {\left\{ {{I_{i}(n)} + {j\;{Q_{i}(n)}}} \right\}*\left\{ {{{{h_{1}(n)} \cdot \cos}\;\omega_{1}n} + {{{h_{2}(n)} \cdot \cos}\;\omega_{1}n} + \ldots + {{{h_{N}(n)} \cdot \cos}\;\omega_{N}n} + {j\left\lbrack {{{{h_{1}(n)} \cdot \sin}\;\omega_{1}n} + {{{h_{2}(n)} \cdot \sin}\;\omega_{1}n} + \ldots + {{{h_{N}(n)} \cdot \sin}\;\omega_{N}n}} \right\rbrack}} \right\}}} & \lbrack 17\rbrack \end{matrix}$ where * indicates the convolution process,

$\begin{matrix} {{{x(n)}*{y(n)}} = {\sum\limits_{k = 0}^{N - 1}{{x(k)}{{y\left( {n - k} \right)}.}}}} & \lbrack 18\rbrack \end{matrix}$ In the above equation, h_(i)(n) is the low pass version of the desired filter and ω_(i) is the angular frequency of the desired signal. The filters h_(i)(n) can have different spectral shapes.

Thus:

$\begin{matrix} {{{I_{o}(n)} + {j\;{Q_{o}(n)}}} = {\left\{ {{I_{i}(n)} + {j\;{Q_{i}(n)}}} \right\}*{g(n)}}} & \lbrack 19\rbrack \\ {{= {\left\{ {{{I_{i}(n)}*{g_{c}(n)}} - {{Q_{i}(n)}*{g_{s}(n)}}} \right\} + {j\left\{ {{{I_{i}(n)}*{g_{s}(n)}} + {{Q_{i}(n)}*{g_{c}(n)}}} \right\}}}}{{where}\text{:}}} & \lbrack 20\rbrack \\ {{g(n)} = {{g_{c}(n)} + {j\;{g_{s}(n)}}}} & \lbrack 21\rbrack \end{matrix}$

Thus: g _(c)(n)=h ₁(n)·cos ω₁ n+h ₂(n)·cos ω₁ n+ . . . +h _(N)(n)·cos ω_(N) n  [22] g _(s)(n)=h ₁(n)·sin ω₁ n+h ₂(n)·sin ω₁ n+ . . . +h _(N)(n)·sin ω_(N) n  [23]

The process is to compute the filter shape h_(i)(n), shift it to the desired frequency ω_(i), and then combine each in the above fashion to form the single complex filter g(n).

The IMD reject filter can be implemented in notchband mode where the undesired bands (IMD bands) are selected, and the desired bands removed. The resulting filtered signal is then removed from the transmit signal to produce the desired signal that is free from the IMD signals.

FIG. 12 illustrates notchbands filtering in accordance with the present teachings. The objective is to remove undesired signal components by isolating the undesired components with filters and then removing those components from the original signal. FIG. 12(A) shows the input signal; FIG. 12(B) shows the spectral characteristic of a notch filter; and FIG. 12(C) shows the output-filtered signal.

The transmitted signal can be a combination of multiple carriers at arbitrary frequency locations, and thus the spectrum can be asymmetric. In these applications multiple undesired-band filters can be designed, followed by a filter combination process to realize the combined filter with a single filter. Let I_(i)(t)+jQ_(i)(t) be the input signal of the filter. The output of the filter can be expressed as I _(o)(n)+jQ _(o)(n)={I _(i)(n)+jQ _(i)(n)}*h _(passthru)(n)·−{I _(i)(n)+jQ _(i)(n)}*[h ₁(n)·e ^(jω) ¹ ^(n) +h ₂(n)·e ^(ω) ² ^(n) + . . . +h _(N)(n)·e ^(jω) ^(N) ^(n)]  [24] If we write I _(o)(n)+jQ _(o)(n)={I _(i)(n)+jQ _(i)(n)}*g(n)  [25] then: g(n)={δ_(k)(n−(N _(taps)+1)/2)−[h ₁(n)·e^(jω) ¹ ^(n) +h ₂(n)·e ^(jω) ² ^(n) + . . . +h _(N)(n)·e ^(jω) ^(N) ^(n)]}  [26] where δ_(k)(n−(N_(taps)+1)/2) is the Kronecker delta function with a delay (N_(taps)+1)/2 which represents the group delay of the odd filter tap length N_(taps) of the h's. This length will be the same for all h's.

Expanding, g(n)={δ_(k)(n−(N _(taps)+1)/2)−[h ₁(n)·cos ω₁ n+h ₂(n)·cos ω₂ n+ . . . +h _(N)(n)·cos ω_(N) n]−j[h ₁(n)·sin ω₁ n+h ₂(n)·sin ω₂ n+ . . . +h _(N)(n)·sin ω_(N) n]}  [27] and I _(o)(n)+jQ _(o)(n)={I _(i)(n)*[δ_(k)(n−(N _(taps)+1)/2)−[h ₁(n)·cos ω₁ n+h ₂(n)·cos ω₂ n+ . . . +h _(N)(n)·cos ω_(N) n]]+Q _(i)(n)*[h ₁(n)·sin ω₁ n+h ₂(n)·sin ω₂ n+ . . . +h _(N)(n)·sin ω_(N) n]}−j{I _(i)(n)*[h ₁(n)·sin ω₁ n+h ₂(n)·sin ω₂ n+ . . . +h _(N)(n)·sin ω_(N) n]−Q _(i)(n)*[δ_(k)(n−(N _(taps)+1)/2)−[h ₁(n)·cos ω₁ n+h ₂(n)·cos ω₂ n+ . . . +h _(N)(n)·cos ω_(N) n]]}  [28] where h_(i)(n) is the lowpass version of the i^(th) undesired-band filter, and ω_(i) is the angular frequency of the undesired signal. The filters h_(i)(n) can have different spectral shapes.

Thus:

$\begin{matrix} {{{I_{o}(n)} + {j\;{Q_{o}(n)}}} = {\left\{ {{I_{i}(n)} + {j\;{Q_{i}(n)}}} \right\}*{g(n)}}} & \lbrack 29\rbrack \\ {{= {\left\{ {{{I_{i}(n)}*{g_{c}(n)}} - {{Q_{i}(n)}*{g_{s}(n)}}} \right\} + {j\left\{ {{{I_{i}(n)}*{g_{s}(n)}} + {{Q_{i}(n)}*{g_{c}(n)}}} \right\}}}}{{where}\text{:}}} & \lbrack 30\rbrack \\ {{g(n)} = {{g_{c}(n)} + {j\;{g_{s}(n)}}}} & \lbrack 31\rbrack \end{matrix}$

Thus g _(c)(n)=δ_(k)(n−(N _(taps)+1)//2)−[h ₁(n)·cos ω₁ n+h ₂(n)·cos ω₁ n+ . . . +h _(N)(n)·cos ω_(N) n]  [32] g _(s)(n)=−[h ₁(n)·sin ω₁ n+h ₂(n)·sin ω₁ n+ . . . +h _(N)(n)·sin ω_(N) n]  [33]

The process is to compute the filter shape h_(i)(n), shift to the desired frequency ω_(i), and then combine each in the above fashion to form the single complex filter, g(n).

To design a combination FIR, a passband filtering approach or notch filtering approach may be used. An illustrative passband filtering approach is as follows:

-   -   (1) Determine the number of passband filters, M, based on the         desired spectral shape,     -   (2) Design the baseband version of the filters. Each filter will         require N_(m) taps, m=1:M,     -   (3) Select the largest number of taps, i.e., N_(max)=Max(N₁, N₂,         N₃, . . . N_(M)),     -   (4) Redesign the filters with maximum number of taps, to obtain         the coefficients {h_(m)(n)} where m=1:M, n=0:N_(max)−1. Since         the filters are at baseband, the coefficients are symmetric.     -   (5) Translate the baseband filter into an WF filter by frequency         shifting. That is:         {w _(m)(n)}={h _(m)(n)e ^(j*2*pi*fm·n)}, m=1:M  [34]     -   (6) Combine the coefficients of {w_(m)(n)} to form the combine         filter coefficients:

$\begin{matrix} {{\left\{ {g(n)} \right\} = {\sum\limits_{m = 1}^{M}{w_{m}(n)}}},{n = {{0\text{:}N} - 1.}}} & \lbrack 35\rbrack \end{matrix}$

This filter selects the passband of the desired signal. In matrix form, the filter weights are computed as:

$\begin{matrix} \begin{matrix} {\left\lbrack {g\mspace{11mu}(0)\mspace{14mu} g\mspace{11mu}(1)\mspace{11mu}\ldots\mspace{11mu} g\mspace{11mu}\left( {N - 1} \right)} \right\rbrack = \left\lbrack {k_{1}\mspace{14mu} k_{2}\mspace{14mu}\ldots\mspace{11mu} k_{M}} \right\rbrack} \\ {\begin{bmatrix} {w_{1}(0)} & {w_{1}(1)} & \ldots & {w_{1}\left( {N - 1} \right)} \\ {w_{2}(0)} & {w_{2}(1)} & \ldots & {w_{2}\left( {N - 1} \right)} \\ \ldots & \ldots & \ldots & \ldots \\ {w_{M}(0)} & {w_{M}(1)} & \ldots & {w_{M}\left( {N - 1} \right)} \end{bmatrix}} \end{matrix} & \lbrack 36\rbrack \end{matrix}$

where k_(p) is the weight associated with p^(th) filter, and w_(p)(0:N−1) are the coefficients of the p^(th) filter.

-   -   (7) Build a single complex FIR with N_(max) taps.         For the notch filtering approach, the process is as follows:     -   (1) Determine the number of notch filters, M, based on the         desired spectral shape,     -   (2) Design the baseband version of the notch filters, each         filter will require N_(m) taps, m=1:M,     -   (3) Select the largest number of taps, i.e., N_(max)=Max(N₁, N₂,         N₃, . . . N_(M)), such as N_(max) is odd.     -   (4) Redesign the filters with maximum number of taps, to obtain         the coefficients {h_(m)(n)} where m=1:M, n=0:N−1. Since the         filters are at baseband, the coefficients are symmetric.     -   (5) Translate the baseband filter into IF filter by frequency         shifting, that is         {w _(m)(n)}={h _(m)(n)e ^(j*2*pi*fm·n)}, m=1:M.  [37]     -   (6) Combine the coefficient of {w_(n)(m)} to form the combine         filter coefficients:

$\begin{matrix} {{\left\{ {g(n)} \right\} = {{\delta_{k}\left( {n - {\left( {N_{\max} + 1} \right)/2}} \right)} - {\sum\limits_{m = 1}^{M}{k_{m}{w_{m}(n)}}}}},{n = {{0\text{:}N} - 1.}}} & \lbrack 38\rbrack \end{matrix}$ This filter removes the notch bands from the original signal. Notes that z^(−(Nmax+1)/2) represents the delay of the original signal. In matrix form, the filter weight is computed as:

$\begin{matrix} {\left\lbrack {{g(0)}\mspace{20mu}{g(1)}\mspace{20mu}\ldots\mspace{20mu}{g\left( {N - 1} \right)}} \right\rbrack = {\left\lbrack {1\mspace{20mu} - {k_{1}\mspace{20mu}\ldots}\mspace{20mu} - k_{M}} \right\rbrack{\quad\begin{bmatrix} 0 & 0 & 1 & 0 & 0 \\ {w_{1}(0)} & {w_{1}(1)} & {w_{1}\left( \frac{N + 1}{2} \right)} & \ldots & {w_{1}\left( {N - 1} \right)} \\ \ldots & \ldots & \ldots & \ldots & \ldots \\ {w_{M}(0)} & {w_{M}(1)} & {w_{M}\left( \frac{N + 1}{2} \right)} & \ldots & {w_{M}\left( {N - 1} \right)} \end{bmatrix}}}} & \lbrack 39\rbrack \end{matrix}$ where k_(p) is the weight associated with p^(th) filter, and w_(p)(0:N−1) are the coefficients of the p^(th) filter.

-   -   (7) Build a single complex FIR with N_(max) taps.         The Multi bands and Arbitrary Shape Filter structure is as shown         in FIG. 13. The input signal I_(i)(n)+jQ_(i)(n) passes through a         tap delay line of length N (=N_(max)), selected to support the         filter h_(i)(n) spectral requirements.         By careful manipulation of the following equation, the         coefficients, g_(c)(n) and g_(s)(n) can be forced to be         symmetric and anti-symmetric. In the equation,         I _(o)(n)+jQ _(o)(n)={I _(i)(n)+jQ _(i)(n)}*{h ₁(n)·e ^(jω) ¹         ^(n) +h ₂(n)·e ^(jω) ² ^(n) + . . . +h _(N)(n)·e ^(jω) ^(N)         ^(n)}         we can write each of the modulated filter coefficient terms as         w _(m)(n)=h _(m)(n)·e ^(jω) ^(m) ^(n) =h _(m)(0)e ^(jω) ^(m) ⁰         ,h _(m)(1)e ^(jω) ^(m) ¹ ,h _(m)(2)e ^(jω) ¹ ² , . . . h         _(m)(N−1)e ^(jω) ^(m() ^(N−1))         w _(m)(n)=e ^(jω) ^(m) ^((N−1)/2)(h _(m)(0)e ^(−jω) ^(m)         ^((N−1)/2) ,h _(m)(1)e ^(ω) ^(m) ^((1−(N−1)/) ²⁾ ,h _(m)(2)e         ^(jω) ^(m) ^((2−(N−1)/2)) , . . . , h _(m)(N−1)e ^(jω) ^(m)         ^((N−1)/2))         Since the constant phase does not effect the filtering of the         signal, we can remove it. For ease of notation, we continue to         use the same variable with the constant phase removed.         w _(m)(n)=h _(m)(0)e ^(−jω) ^(m) ^((N−1)/2) ,h _(m)(1)e ^(jω)         ^(m) ^((1−(N−1)/2)) ,h _(m)(2)e ^(jω) ^(m) ^((2−(N−1)/2)) , . .         . , h _(m)(N−1)e ^(jω) ^(m) ^((N−1)/2))         The real part of the m^(th) set of weights is         Re(w _(m)(n))=(h _(m)(0)cos(−w _(m)(N−1)/2),h _(m)(1)cos(−w         _(m)((N−1)/2)−1), . . . , h _(m)(N−2)cos(w _(m)((N−1)/2)−1),h         _(m)(N−1)cos(w _(m)(N−1)/2)         The imaginary part of the mth set of weights is         Im(w _(m)(n))=(h _(m)(0)sin(−w _(m)(N−1)/2),h _(m)(1)sin(−w         _(m)((N−1)/2)−1), . . . , h _(m)(N−2)sin(w _(m)((N−1)/2)−1),h         _(m)(N−1)sin(w _(m)(N−1)/2)         Note that the real part of w_(m)(n) is symmetric since         corresponding taps are h_(m)(p)cos(−w_(m)((N−1)/2−p)) and         h_(m)(N−1−p)cos(w_(m)((N−1)/2−p)), h_(m)(n) is symmetric         (baseband filter), and cos(−u)=cos(u). Note that the imaginary         part of w_(m)(n) is anti-symmetric since corresponding taps are         h_(m)(p)sin(−w_(m)((N−1)/2−p)) and         h_(m)(N−1−p)sin(w_(m)((N−1)/2−p)) and sin(−u)=−sin(u).         The sum of all of the weights, g(n), shares all of the symmetry         properties of its component filter weights since they are all         the same size and addition does not change symmetry properties         if all of the terms have the same symmetry property. Thus,         g _(c)(n)=Re(g(n))=g _(c)(0),g _(c)(1),g _(c)(N−2),g _(c)(N−1)         where g_(c)(p)=g_(c)(N−1−p)         g _(s)(n)=Im(g(n))=g _(s)(0),g _(s)(1), . . . , g _(s)(N−2),g         _(s)(N−1)         where g_(s)(p)=−g_(s)(N−1−p)         By using the usual technique of presuming for symmetric filters,         we find that the output can be written as

${X_{o}(n)} = {{{x_{i}(n)} \star {g(n)}} = {\sum\limits_{k = 0}^{N - 1}{{X_{i}\left( {n - k} \right)}{g(k)}}}}$ ${X_{o}(n)} = {{\sum\limits_{k = 0}^{N - 1}{{{Re}\left( {X_{i}\left( {n - k} \right)} \right)}{{Re}\left( {g(k)} \right)}}} - {{{Im}\left( {X_{i}\left( {n - k} \right)} \right)}{{Im}\left( {g(k)} \right)}} + {j\text{(}{{Re}\left( {X_{i}\left( {n - k} \right)} \right)}{{Im}\left( {g(k)} \right)}} + {{{Im}\left( {X_{i}\left( {n - k} \right)} \right)}{{Re}\left( {g(k)} \right)}\text{)}}}$ ${X_{o}(n)} = {{\sum\limits_{k = 0}^{N - 1}{{{Re}\left( {X_{i}\left( {n - k} \right)} \right)}{g_{c}(k)}\text{)}}} - {{{Im}\left( {X_{i}\left( {n - k} \right)} \right)}{g_{s}(k)}} + {j\text{(}{{Re}\left( {X_{i}\left( {n - k} \right)} \right)}{g_{s}(k)}} + {{{Im}\left( {X_{i}\left( {n - k} \right)} \right)}{g_{c}(k)}\text{)}}}$ ${{For}\mspace{14mu}{even}\mspace{14mu} N},{{X_{o}(n)} = {{\sum\limits_{k = 0}^{{({N - 2})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {n - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} - {\left( {{{Im}\left( {X_{i}\left( {n - k} \right)} \right)} - {{Im}\left( {X_{i}\left( {N - 1 - \left( {n - k} \right)} \right)} \right)}} \right){g_{s}(k)}} + {{j\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {n - k} \right)} \right)} \right)}} \right)}{g_{s}(k)}} + {{Im}\left( {X_{i}\left( {n - k} \right)} \right)} - {{{Im}\left( {X_{i}\left( {N - 1 - \left( {n - k} \right)} \right)} \right)}\text{)}{g_{c}(k)}\text{)}}}}$ Grouping the terms alone leads to

${X_{o}(n)} = {{\sum\limits_{k = 0}^{{({N - 2})}/2}{\text{(}{{Re}\left( {X_{i}\left( {n - k} \right)} \right)}}} + {{{Re}\left( {X_{i}\left( {N - 1 - \left( {n - k} \right)} \right)} \right)}\text{)}{g_{c}(k)}} - {\sum\limits_{k = 0}^{{({N - 2})}/2}{\left( {{{Im}\left( {X_{i}\left( {n - k} \right)} \right)} - {{Im}\left( {X_{i}\left( {N - 1 - \left( {n - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {j\left\{ {{\sum\limits_{k = 0}^{{({N - 2})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {n - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {\sum\limits_{k = 0}^{{({N - 2})}/2}{{Im}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{{Im}\left( {X_{i}\left( {N - 1 - \left( {n - k} \right)} \right)} \right)}\text{)}{g_{c}(k)}\text{)}}} \right\}}}$ Thus, the implementation is to presume the symmetric taps at the adders as shown in FIG. 13 thus saving multipliers. The taps which will be multiplied by the imaginary weights are subtracted while the taps multiplied by the real weights are added. FIG. 13 is a conceptual drawing showing a symmetric and asymmetric FIR filter implementation where presuming is performed followed by multiplication by a coefficient followed by a summing of all of the products. In actual implementation, each coefficient multiply occurs at the same time and the outputs are all added. This is the same as in any FIR filter implementation. Note that symmetry is exploited, reducing the number of multiplications required by a factor of one-half. For odd N, grouping the terms and properly dealing with the center taps leads to

${X_{o}(n)} = {\left\{ {{\sum\limits_{k = 0}^{{({N - 3})}/2}{\text{(}{{Re}\left( {X_{i}\left( {n - k} \right)} \right)}}} + {{{Re}\left( {X_{i}\left( {N - 1 - \left( {n - k} \right)} \right)} \right)}\text{)}{g_{c}(k)}}} \right\} + \mspace{166mu}{{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}} - \mspace{85mu}\left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Im}\left( {X_{i}\left( {n - k} \right)} \right)} - {{Im}\left( {X_{i}\left( {N - 1 - \left( {n - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + \mspace{166mu}{{{Im}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right\rbrack}} + \mspace{65mu}{j\left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {n - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + \mspace{169mu}{j\text{(}{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}} + \mspace{65mu}\left\{ {{\sum\limits_{k = 0}^{{({N - 3})}/2}{{Im}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{{Im}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}\text{)}{g_{c}(k)}\text{)}}} \right\} - \mspace{385mu}{{{Im}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}\text{)}}} \right\rbrack}} \right.}$ FIG. 14 shows this implementation. Again this is a conceptual drawing showing a symmetric FIR filter implementation where presuming is performed followed by multiplication by a coefficient followed by a summing of all of the products. In the case of odd length filter coefficients, the center tap is not pre-summed and is instead simply directly multiplied by its coefficient.

FIG. 13 is an illustrative implementation of a single Multi bands and Arbitrary Shape Filter that support multiple bandpass signals for even length filter.

FIG. 14 is an illustrative implementation of a single Multi bands and Arbitrary Shape Filter that support multiple bandpass signals for odd length filter.

The devices and subsystems of the exemplary embodiments of FIGS. 1-14 can include computer readable medium or memories for holding instructions programmed according to the teachings of the present invention and for holding data structures, tables, records, and/or other data described herein. Computer readable medium can include any suitable medium that participates in providing instructions to a processor for execution. Such a medium can take many forms, including but not limited to, non-volatile media, volatile media, etc. Non-volatile media can include, for example, optical or magnetic disks, magneto-optical disks, and the like. Volatile media can include dynamic memories, and the like. Transmission media can include coaxial cables, copper wire, fiber optics, and the like. Common forms of computer-readable media can include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, any other suitable magnetic medium, a CD-ROM, CDRW, DVD, any other suitable optical medium, a RAM, a PROM, an EPROM, a FLASH-EPROM, any other suitable memory chip or cartridge, or any other suitable medium from which a computer can read.

Thus, the present invention has been described herein with reference to a particular embodiment for a particular application. Those having ordinary skill in the art and access to the present teachings will recognize additional modifications applications and embodiments within the scope thereof.

It is therefore intended by the appended claims to cover any and all such applications, modifications and embodiments within the scope of the present invention.

Accordingly, 

1. A crest factor reduction system, the system comprising: a peak amplitude suppressor for suppressing peak amplitudes of an input signal X(n) relative to an average value of the input signal and providing a peak amplitude suppressed signal with a reduced peak-to-average ratio (PAR) in response thereto; said peak amplitude suppressor works on the input signal X(n), on a sample by sample basis, according to the following equation: X(n)=X(n) if A(n)<T X(n)=X(n)·T/A(n) if A(n)≧T where A(n) is an approximation of an amplitude of an nth sample of said input signal X(n) or A(n) is an amplitude of an nth sample of said input signal X(n) given by A(n)=√{square root over (real(X(n))²+imag(X(n))²)}{square root over (real(X(n))²+imag(X(n))²)}, T is a clipping threshold of the peak amplitude suppressor, and T/A(n) is a gain factor of the nth sample of X(n); and an intermodulation reject filter coupled to said peak amplitude suppressor for rejecting intermodulation distortion in said amplitude suppressed signal, said intermodulation reject filter's output being a peak suppressed version of said input signal, wherein said intermodulation reject filter is a single filter whose coefficients are derived from frequency shifting and adding coefficients of a baseband-designed filter for a single carrier, a baseband-designed filter for two adjacent carriers, a baseband-designed filter for three adjacent carriers, up to a baseband-designed filter for M adjacent carriers where a largest filter of the adjacent carriers is used wherever the adjacent carriers are present and each of the carriers falls in a passband of exactly one of the frequency-shifted baseband-designed filters.
 2. The system of claim 1, wherein said intermodulation reject filter includes bandpass filters implemented by employing real and imaginary inputs according to the following equation for an even number of taps, N, $\left. \left. {\left. \left. {{X_{o}(n)} = {{\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} - {\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {j\left\{ {{\sum\limits_{k = 0}^{{({N - 2})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {\sum\limits_{k = 0}^{{({N - 2})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}}} \right) \right\},{{and}\mspace{14mu}{for}\mspace{14mu}{an}\mspace{14mu}{odd}\mspace{14mu}{number}\mspace{14mu}{of}\mspace{14mu}{taps}},N,{{X_{o}(n)} = {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right\} + {{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}} - \left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}}} \right\rbrack + {j\left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {j\left( {{{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}} + {\left\{ {{\sum\limits_{k = 0}^{{({N - 3})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right)}} \right\}} - {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}}}}} \right) \right\rbrack$ ${{where}\mspace{14mu}{X_{i}(n)}\mspace{14mu}{is}\mspace{14mu}{the}\mspace{14mu}{input}\mspace{14mu}{signal}},{\left\{ {g(n)} \right\} = {\sum\limits_{m = 1}^{M}\;{w_{m}(n)}}},{n = {{0\text{:}N} - 1}},{\left\{ {w_{m}(n)} \right\} = \left\{ {{h_{m}(n)}{\mathbb{e}}^{j*2*p\;{\mathbb{i}}*{{fm} \cdot n}}} \right\}},{m = {1\text{:}M}}$ h_(m)(n) are symmetric baseband filters, one per carrier of said input signal, g_(c)(n) is a real part of g(n), real(g(n)), g_(s)(n) is an imaginary part of g(n), imag(g(n)), fm is a center frequency of the mth filter, and N is a number of taps in the filter.
 3. The system of claim 1, wherein A(n) is an approximation of said amplitude computed using a CORDIC (COordinate Rotation DIgital Computer) or other computing device.
 4. The system of claim 1, wherein said gain factor is computed using a lookup table.
 5. A crest factor reduction system, the system comprising: a peak amplitude suppressor for suppressing peak amplitudes of an input signal X(n) relative to an average value of the input signal and providing a peak amplitude suppressed signal with a reduced peak-to-average ratio (PAR) in response thereto; said peak amplitude suppressor works on the input signal X(n), on a sample by sample basis, according to the following equation: X(n)=X(n) if A(n)<T X(n)=X(n)·T/A(n) if A(n)≧T where A(n) is an approximation of an amplitude of an nth sample of said input signal X(n) or A(n) is an amplitude of an nth sample of said input signal X(n) given by A(n)=√{square root over (real(X(n))²+imag(X(n))²)}{square root over (real(X(n))²+imag(X(n))²)}, T is a clipping threshold of the peak amplitude suppressor, and T/A(n) is a gain factor of the nth sample of X(n); and an intermodulation reject filter coupled to said peak amplitude suppressor for rejecting intermodulation distortion in said amplitude suppressed signal, said intermodulation reject filter's output being a peak suppressed version of said input signal, wherein said intermodulation reject filter is a plurality of bandpass filters, one filter corresponding to each carrier present in said input signal, a passband of each of said filters centered on its corresponding carrier, with a delay at an output of each of said filters, and a summer for adding the outputs of the bandpass filters, and said bandpass filters are implemented by employing real and imaginary inputs according to the following equation for an even number of taps, N, $\left. \left. {\left. \left. {{X_{o}(n)} = {{\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} - {\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {j\left\{ {{\sum\limits_{k = 0}^{{({N - 2})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {\sum\limits_{k = 0}^{{({N - 2})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}}} \right) \right\},{{and}\mspace{14mu}{for}\mspace{14mu}{an}\mspace{14mu}{odd}\mspace{14mu}{number}\mspace{14mu}{of}\mspace{14mu}{taps}},N,{{X_{o}(n)} = {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right\} + {{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}} - \left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}}} \right\rbrack + {j\left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {j\left( {{{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}} + {\left\{ {{\sum\limits_{k = 0}^{{({N - 3})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right)}} \right\}} - {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}}}}} \right) \right\rbrack$ ${{where}\mspace{14mu}{X_{i}(n)}\mspace{14mu}{is}\mspace{14mu}{the}\mspace{14mu}{input}\mspace{14mu}{signal}},{\left\{ {g(n)} \right\} = {\sum\limits_{m = 1}^{M}\;{w_{m}(n)}}},{n = {{0\text{:}N} - 1}},{\left\{ {w_{m}(n)} \right\} = \left\{ {{h_{m}(n)}{\mathbb{e}}^{j*2*p\;{\mathbb{i}}*{{fm} \cdot n}}} \right\}},{m = {1\text{:}M}}$ h_(m)(n) are symmetric baseband filters, one per carrier of said input signal, g_(c)(n) is a real part of g(n), real(g(n)), g_(s)(n) is an imaginary part of g(n), imag(g(n)), fm is a center frequency of the mth filter, and N is a number of taps in the filter.
 6. The system of claim 5, wherein said gain factor is computed using a lookup table.
 7. The system of claim 5, wherein A(n) is an approximation of said amplitude computed using a CORDIC (COordinate Rotation DIgital Computer) or other computing device.
 8. A crest factor reduction system, the system comprising: a peak amplitude suppressor for suppressing peak amplitudes of an input signal X(n) relative to an average value of the input signal and providing a peak amplitude suppressed signal with a reduced peak-to-average ratio (PAR) in response thereto; said peak amplitude suppressor works on the input signal X(n), on a sample by sample basis, according to the following equation: X(n)=X(n) if A(n)<T X(n)=X(n)·T/A(n) if A(n)≧T where A(n) is an approximation of an amplitude of an nth sample of said input signal X(n) or A(n) is an amplitude of an nth sample of said input signal X(n) given by A(n)=√{square root over (real(X(n))²+imag(X(n))²)}{square root over (real(X(n))²+imag(X(n))²)}, T is a clipping threshold of the peak amplitude suppressor, and T/A(n) is a gain factor of the nth sample of X(n); and an intermodulation reject filter coupled to said peak amplitude suppressor for rejecting intermodulation distortion in said amplitude suppressed signal, said intermodulation reject filter's output being a peak suppressed version of said input signal, wherein said intermodulation reject filter is a single filter whose coefficients are derived from a sum of band pass filters, one filter corresponding to each carrier present in said input signal, a passband of each of said filters centered on its corresponding carrier, and said band pass filters are implemented by employing real and imaginary inputs according to the following equation for an even number of taps, N, $\left. \left. {\left. \left. {{X_{o}(n)} = {{\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} - {\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {j\left\{ {{\sum\limits_{k = 0}^{{({N - 2})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {\sum\limits_{k = 0}^{{({N - 2})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}}} \right) \right\},{{and}\mspace{14mu}{for}\mspace{14mu}{an}\mspace{14mu}{odd}\mspace{14mu}{number}\mspace{14mu}{of}\mspace{14mu}{taps}},N,{{X_{o}(n)} = {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right\} + {{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}} - \left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}}} \right\rbrack + {j\left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {j\left( {{{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}} + {\left\{ {{\sum\limits_{k = 0}^{{({N - 3})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right)}} \right\}} - {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}}}}} \right) \right\rbrack$ ${{where}\mspace{14mu}{X_{i}(n)}\mspace{14mu}{is}\mspace{14mu}{the}\mspace{14mu}{input}\mspace{14mu}{signal}},{\left\{ {g(n)} \right\} = {\sum\limits_{m = 1}^{M}\;{w_{m}(n)}}},{n = {{0\text{:}N} - 1}},{\left\{ {w_{m}(n)} \right\} = \left\{ {{h_{m}(n)}{\mathbb{e}}^{j*2*p\;{\mathbb{i}}*{{fm} \cdot n}}} \right\}},{m = {1\text{:}M}}$ h_(m)(n) are symmetric baseband filters, one per carrier of said input signal, g_(c)(n) is a real part of g(n), real(g(n)), g_(s)(n) is an imaginary part of g(n), imag(g(n)), fm is a center frequency of the mth filter, and N is a number of taps in the filter.
 9. The system of claim 8, wherein said gain factor is computed using a lookup table.
 10. The system of claim 8, wherein A(n) is an approximation of said amplitude computed using a CORDIC (COordinate Rotation DIgital Computer) or other computing device.
 11. A crest factor reduction method, the method comprising: suppressing via a peak amplitude suppressor peak amplitudes of an input signal X(n) relative to an average value of the input signal and providing a peak amplitude suppressed signal with a reduced peak-to-average ratio (PAR) in response thereto; said peak amplitude suppressor works on the input signal X(n), on a sample by sample basis, according to the following equation: X(n)=X(n) if A(n)<T X(n)=X(n)·T/A(n) if A(n)≧T where A(n) is an approximation of an amplitude of an nth sample of said input signal X(n) or A(n) is an amplitude of an nth sample of said input signal X(n) given by A(n)=√{square root over (real(X(n))²+imag(X(n))²)}{square root over (real(X(n))²+imag(X(n))²)}, T is a clipping threshold of the peak amplitude suppressor, and T/A(n) is a gain factor of the nth sample of X(n); and rejecting intermodulation distortion in said amplitude suppressed signal via an intermodulation reject filter coupled to said peak amplitude suppressor, said intermodulation reject filter's output being a peak suppressed version of said input signal, wherein said intermodulation reject filter is a single filter whose coefficients are derived from frequency shifting and adding coefficients of a baseband-designed filter for a single carrier, a baseband-designed filter for two adjacent carriers, a baseband-designed filter for three adjacent carriers, up to a baseband-designed filter for M adjacent carriers where a largest filter of the adjacent carriers is used wherever the adjacent carriers are present and each of the carriers falls in a passband of exactly one of the frequency-shifted baseband-designed filters.
 12. The method of claim 11, wherein said gain factor is computed using a lookup table.
 13. The method of claim 11, wherein said intermodulation reject filter includes bandpass filters implemented by employing real and imaginary inputs according to the following equation for an even number of taps, N, $\left. \left. {\left. \left. {{X_{o}(n)} = {{\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} - {\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {j\left\{ {{\sum\limits_{k = 0}^{{({N - 2})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {\sum\limits_{k = 0}^{{({N - 2})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}}} \right) \right\},{{and}\mspace{14mu}{for}\mspace{14mu}{an}\mspace{14mu}{odd}\mspace{14mu}{number}\mspace{14mu}{of}\mspace{14mu}{taps}},N,{{X_{o}(n)} = {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right\} + {{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}} - \left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}}} \right\rbrack + {j\left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {j\left( {{{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}} + {\left\{ {{\sum\limits_{k = 0}^{{({N - 3})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right)}} \right\}} - {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}}}}} \right) \right\rbrack$ ${{where}\mspace{14mu}{X_{i}(n)}\mspace{14mu}{is}\mspace{14mu}{the}\mspace{14mu}{input}\mspace{14mu}{signal}},{\left\{ {g(n)} \right\} = {\sum\limits_{m = 1}^{M}\;{w_{m}(n)}}},{n = {{0\text{:}N} - 1}},{\left\{ {w_{m}(n)} \right\} = \left\{ {{h_{m}(n)}{\mathbb{e}}^{j*2*p\;{\mathbb{i}}*{{fm} \cdot n}}} \right\}},{m = {1\text{:}M}}$ h_(m)(n) are symmetric baseband filters, one per carrier of said input signal, g_(c)(n) is a real part of g(n), real(g(n)), g_(s)(n) is an imaginary part of g(n), imag(g(n)), fm is a center frequency of the mth filter, and N is a number of taps in the filter.
 14. The method of claim 11, wherein A(n) is an approximation of said amplitude computed using a CORDIC (COordinate Rotation DIgital Computer) or other computing device.
 15. A crest factor reduction method, the method comprising: suppressing via a peak amplitude suppressor peak amplitudes of an input signal X(n) relative to an average value of the input signal and providing a peak amplitude suppressed signal with a reduced peak-to-average ratio (PAR) in response thereto; said peak amplitude suppressor works on the input signal X(n), on a sample by sample basis, according to the following equation: X(n)=X(n) if A(n)<T X(n)=X(n)·T/A(n) if A(n)≧T where A(n) is an approximation of an amplitude of an nth sample of said input signal X(n) or A(n) is an amplitude of an nth sample of said input signal X(n) given by A(n)=√{square root over (real(X(n))²+imag(X(n))²)}{square root over (real(X(n))²+imag(X(n))²)}, T is a clipping threshold of the peak amplitude suppressor, and T/A(n) is a gain factor of the nth sample of X(n); and rejecting intermodulation distortion in said amplitude suppressed signal via an intermodulation reject filter coupled to said peak amplitude suppressor, said intermodulation reject filter's output being a peak suppressed version of said input signal, wherein said intermodulation reject filter is a plurality of bandpass filters, one filter corresponding to each carrier present in said input signal, a passband of each of said filters centered on its corresponding carrier, with a delay at an output of each of said filters, and a summer for adding the outputs of the bandpass filters, and said bandpass filters are implemented by employing real and imaginary inputs according to the following equation for an even number of taps, N, $\left. \left. {\left. \left. {{X_{o}(n)} = {{\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} - {\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {j\left\{ {{\sum\limits_{k = 0}^{{({N - 2})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {\sum\limits_{k = 0}^{{({N - 2})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}}} \right) \right\},{{and}\mspace{14mu}{for}\mspace{14mu}{an}\mspace{14mu}{odd}\mspace{14mu}{number}\mspace{14mu}{of}\mspace{14mu}{taps}},N,{{X_{o}(n)} = {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right\} + {{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}} - \left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}}} \right\rbrack + {j\left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {j\left( {{{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}} + {\left\{ {{\sum\limits_{k = 0}^{{({N - 3})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right)}} \right\}} - {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}}}}} \right) \right\rbrack$ ${{where}\mspace{14mu}{X_{i}(n)}\mspace{14mu}{is}\mspace{14mu}{the}\mspace{14mu}{input}\mspace{14mu}{signal}},{\left\{ {g(n)} \right\} = {\sum\limits_{m = 1}^{M}\;{w_{m}(n)}}},{n = {{0\text{:}N} - 1}},{\left\{ {w_{m}(n)} \right\} = \left\{ {{h_{m}(n)}{\mathbb{e}}^{j*2*p\;{\mathbb{i}}*{{fm} \cdot n}}} \right\}},{m = {1\text{:}M}}$ h_(m)(n) are symmetric baseband filters, one per carrier of said input signal, g_(c)(n) is a real part of g(n), real(g(n)), g_(s)(n) is an imaginary part of g(n), imag(g(n)), fm is a center frequency of the mth filter, and N is a number of taps in the filter.
 16. The method of claim 15, wherein said gain factor is computed using a lookup table.
 17. The method of claim 15, wherein A(n) is an approximation of said amplitude computed using a CORDIC (COordinate Rotation DIgital Computer) or other computing device.
 18. A crest factor reduction method, the method comprising: suppressing via a peak amplitude suppressor peak amplitudes of an input signal X(n) relative to an average value of the input signal and providing a peak amplitude suppressed signal with a reduced peak-to-average ratio (PAR) in response thereto; said peak amplitude suppressor works on the input signal X(n), on a sample by sample basis, according to the following equation: X(n)=X(n) if A(n)<T X(n)=X(n)·T/A(n) if A(n)≧T where A(n) is an approximation of an amplitude of an nth sample of said input signal X(n) or A(n) is an amplitude of an nth sample of said input signal X(n) given by A(n)=√{square root over (real(X(n))²+imag(X(n))²)}{square root over (real(X(n))²+imag(X(n))²)}, T is a clipping threshold of the peak amplitude suppressor, and T/A(n) is a gain factor of the nth sample of X(n); and rejecting intermodulation distortion in said amplitude suppressed signal via an intermodulation reject filter coupled to said peak amplitude suppressor, said intermodulation reject filter's output being a peak suppressed version of said input signal, wherein said intermodulation reject filter is a single filter whose coefficients are derived from a sum of band pass filters, one filter corresponding to each carrier present in said input signal, a passband of each of said filters centered on its corresponding carrier, and said band pass filters are implemented by employing real and imaginary inputs according to the following equation for an even number of taps, N, $\left. \left. {\left. \left. {{X_{o}(n)} = {{\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} - {\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {j\left\{ {{\sum\limits_{k = 0}^{{({N - 2})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {\sum\limits_{k = 0}^{{({N - 2})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}}} \right) \right\},{{and}\mspace{14mu}{for}\mspace{14mu}{an}\mspace{14mu}{odd}\mspace{14mu}{number}\mspace{14mu}{of}\mspace{14mu}{taps}},N,{{X_{o}(n)} = {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right\} + {{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}} - \left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}}} \right\rbrack + {j\left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {j\left( {{{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}} + {\left\{ {{\sum\limits_{k = 0}^{{({N - 3})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right)}} \right\}} - {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}}}}} \right) \right\rbrack$ ${{where}\mspace{14mu}{X_{i}(n)}\mspace{14mu}{is}\mspace{14mu}{the}\mspace{14mu}{input}\mspace{14mu}{signal}},{\left\{ {g(n)} \right\} = {\sum\limits_{m = 1}^{M}\;{w_{m}(n)}}},{n = {{0\text{:}N} - 1}},{\left\{ {w_{m}(n)} \right\} = \left\{ {{h_{m}(n)}{\mathbb{e}}^{j*2*p\;{\mathbb{i}}*{{fm} \cdot n}}} \right\}},{m = {1\text{:}M}}$ h_(m)(n) are symmetric baseband filters, one per carrier of said input signal, g_(c)(n) is a real part of g(n), real(g(n)), g_(s)(n) is an imaginary part of g(n), imag(g(n)), fm is a center frequency of the mth filter, and N is a number of taps in the filter.
 19. The method of claim 18, wherein said gain factor is computed using a lookup table.
 20. The system of claim 18, wherein A(n) is an approximation of said amplitude computed using a CORDIC (COordinate Rotation DIgital Computer) or other computing device.
 21. A computer program product for crest factor reduction, and including one or more computer readable instructions embedded on a tangible computer readable medium and configured to cause one or more computer processors to perform the steps of: suppressing via a peak amplitude suppressor peak amplitudes of an input signal X(n) relative to an average value of the input signal and providing a peak amplitude suppressed signal with a reduced peak-to-average ratio (PAR) in response thereto; said peak amplitude suppressor works on the input signal X(n), on a sample by sample basis, according to the following equation: X(n)=X(n) if A(n)<T X(n)=X(n)·T/A(n) if A(n)≧T where A(n) is an approximation of an amplitude of an nth sample of said input signal X(n) or A(n) is an amplitude of an nth sample of said input signal X(n) given by A(n)=√{square root over (real(X(n))²+imag(X(n))²)}{square root over (real(X(n))²+imag(X(n))²)}, T is a clipping threshold of the peak amplitude suppressor, and T/A(n) is a gain factor of the nth sample of X(n); and rejecting intermodulation distortion in said amplitude suppressed signal via an intermodulation reject filter coupled to said peak amplitude suppressor, said intermodulation reject filter's output being a peak suppressed version of said input signal, wherein said intermodulation reject filter is a single filter whose coefficients are derived from frequency shifting and adding coefficients of a baseband-designed filter for a single carrier, a baseband-designed filter for two adjacent carriers, a baseband-designed filter for three adjacent carriers, up to a baseband-designed filter for M adjacent carriers where a largest filter of the adjacent carriers is used wherever the adjacent carriers are present and each of the carriers falls in a passband of exactly one of the frequency-shifted baseband-designed filters.
 22. The computer program product of claim 21, wherein said gain factor is computed using a lookup table.
 23. The computer program product of claim 21, wherein said intermodulation reject filter includes bandpass filters implemented by employing real and imaginary inputs according to the following equation for an even number of taps, N, $\left. \left. {\left. \left. {{X_{o}(n)} = {{\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} - {\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {j\left\{ {{\sum\limits_{k = 0}^{{({N - 2})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {\sum\limits_{k = 0}^{{({N - 2})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}}} \right) \right\},{{and}\mspace{14mu}{for}\mspace{14mu}{an}\mspace{14mu}{odd}\mspace{14mu}{number}\mspace{14mu}{of}\mspace{14mu}{taps}},N,{{X_{o}(n)} = {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right\} + {{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}} - \left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}}} \right\rbrack + {j\left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {j\left( {{{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}} + {\left\{ {{\sum\limits_{k = 0}^{{({N - 3})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right)}} \right\}} - {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}}}}} \right) \right\rbrack$ ${{where}\mspace{14mu}{X_{i}(n)}\mspace{14mu}{is}\mspace{14mu}{the}\mspace{14mu}{input}\mspace{14mu}{signal}},{\left\{ {g(n)} \right\} = {\sum\limits_{m = 1}^{M}\;{w_{m}(n)}}},{n = {{0\text{:}N} - 1}},{\left\{ {w_{m}(n)} \right\} = \left\{ {{h_{m}(n)}{\mathbb{e}}^{j*2*p\;{\mathbb{i}}*{{fm} \cdot n}}} \right\}},{m = {1\text{:}M}}$ h_(m)(n) are symmetric baseband filters, one per carrier of said input signal, g_(c)(n) is a real part of g(n), real(g(n)), g_(s)(n) is an imaginary part of g(n), imag(g(n)), fm is a center frequency of the mth filter, and N is a number of taps in the filter.
 24. The computer program product of claim 21, wherein A(n) is an approximation of said amplitude computed using a CORDIC (COordinate Rotation DIgital Computer) or other computing device.
 25. A computer program product for crest factor reduction, and including one or more computer readable instructions embedded on a tangible computer readable medium and configured to cause one or more computer processors to perform the steps of: suppressing via a peak amplitude suppressor peak amplitudes of an input signal X(n) relative to an average value of the input signal and providing a peak amplitude suppressed signal with a reduced peak-to-average ratio (PAR) in response thereto; said peak amplitude suppressor works on the input signal X(n), on a sample by sample basis, according to the following equation: X(n)=X(n) if A(n)<T X(n)=X(n)·T/A(n) if A(n)≧T where A(n) is an approximation of an amplitude of an nth sample of said input signal X(n) or A(n) is an amplitude of an nth sample of said input signal X(n) given by A(n)=√{square root over (real(X(n))²+imag(X(n))²)}{square root over (real(X(n))²+imag(X(n))²)}, T is a clipping threshold of the peak amplitude suppressor, and T/A(n) is a gain factor of the nth sample of X(n); and rejecting intermodulation distortion in said amplitude suppressed signal via an intermodulation reject filter coupled to said peak amplitude suppressor, said intermodulation reject filter's output being a peak suppressed version of said input signal, wherein said intermodulation reject filter is a plurality of bandpass filters, one filter corresponding to each carrier present in said input signal, a passband of each of said filters centered on its corresponding carrier, with a delay at an output of each of said filters, and a summer for adding the outputs of the bandpass filters, and said bandpass filters are implemented by employing real and imaginary inputs according to the following equation for an even number of taps, N, $\left. \left. {\left. \left. {{X_{o}(n)} = {{\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} - {\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {j\left\{ {{\sum\limits_{k = 0}^{{({N - 2})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {\sum\limits_{k = 0}^{{({N - 2})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}}} \right) \right\},{{and}\mspace{14mu}{for}\mspace{14mu}{an}\mspace{14mu}{odd}\mspace{14mu}{number}\mspace{14mu}{of}\mspace{14mu}{taps}},N,{{X_{o}(n)} = {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right\} + {{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}} - \left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}}} \right\rbrack + {j\left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {j\left( {{{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}} + {\left\{ {{\sum\limits_{k = 0}^{{({N - 3})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right)}} \right\}} - {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}}}}} \right) \right\rbrack$ ${{where}\mspace{14mu}{X_{i}(n)}\mspace{14mu}{is}\mspace{14mu}{the}\mspace{14mu}{input}\mspace{14mu}{signal}},{\left\{ {g(n)} \right\} = {\sum\limits_{m = 1}^{M}\;{w_{m}(n)}}},{n = {{0\text{:}N} - 1}},{\left\{ {w_{m}(n)} \right\} = \left\{ {{h_{m}(n)}{\mathbb{e}}^{j*2*p\;{\mathbb{i}}*{{fm} \cdot n}}} \right\}},{m = {1\text{:}M}}$ h_(m)(n) are symmetric baseband filters, one per carrier of said input signal, g_(c)(n) is a real part of g(n), real(g(n)), g_(s)(n) is an imaginary part of g(n), imag(g(n)), fm is a center frequency of the mth filter, and N is a number of taps in the filter.
 26. The computer program product of claim 25, wherein said gain factor is computed using a lookup table.
 27. The computer program product of claim 25, wherein A(n) is an approximation of said amplitude computed using a CORDIC (COordinate Rotation DIgital Computer) or other computing device.
 28. A computer program product for crest factor reduction, and including one or more computer readable instructions embedded on a tangible computer readable medium and configured to cause one or more computer processors to perform the steps of: suppressing via a peak amplitude suppressor peak amplitudes of an input signal X(n) relative to an average value of the input signal and providing a peak amplitude suppressed signal with a reduced peak-to-average ratio (PAR) in response thereto; said peak amplitude suppressor works on the input signal X(n), on a sample by sample basis, according to the following equation: X(n)=X(n) if A(n)<T X(n)=X(n)·T/A(n) if A(n)≧T where A(n) is an approximation of an amplitude of an nth sample of said input signal X(n) or A(n) is an amplitude of an nth sample of said input signal X(n) given by A(n)=√{square root over (real(X(n))²+imag(X(n))²)}{square root over (real(X(n))²+imag(X(n))²)}, T is a clipping threshold of the peak amplitude suppressor, and T/A(n) is a gain factor of the nth sample of X(n); and rejecting intermodulation distortion in said amplitude suppressed signal via an intermodulation reject filter coupled to said peak amplitude suppressor, said intermodulation reject filter's output being a peak suppressed version of said input signal, wherein said intermodulation reject filter is a single filter whose coefficients are derived from a sum of band pass filters, one filter corresponding to each carrier present in said input signal, a passband of each of said filters centered on its corresponding carrier, and said band pass filters are implemented by employing real and imaginary inputs according to the following equation for an even number of taps, N, $\left. \left. {\left. \left. {{X_{o}(n)} = {{\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} - {\sum\limits_{k = 0}^{{({N - 2})}/2}\;{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {j\left\{ {{\sum\limits_{k = 0}^{{({N - 2})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} + {\sum\limits_{k = 0}^{{({N - 2})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}}} \right) \right\},{{and}\mspace{14mu}{for}\mspace{14mu}{an}\mspace{14mu}{odd}\mspace{14mu}{number}\mspace{14mu}{of}\mspace{14mu}{taps}},N,{{X_{o}(n)} = {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right\} + {{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}} - \left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{lm}\left( {X_{i}\left( {n - k} \right)} \right)} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}}} \right\rbrack + {j\left\lbrack {\left\{ {\sum\limits_{k = 0}^{{({N - 3})}/2}{\left( {{{Re}\left( {X_{i}\left( {n - k} \right)} \right)} + {{Re}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{s}(k)}}} \right\} + {j\left( {{{{Re}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{s}\left( {\left( {N - 1} \right)/2} \right)}} + {\left\{ {{\sum\limits_{k = 0}^{{({N - 3})}/2}{{lm}\left( {X_{i}\left( {n - k} \right)} \right)}} - {{lm}\left( {X_{i}\left( {N - 1 - \left( {{- n} - k} \right)} \right)} \right)}} \right){g_{c}(k)}}} \right)}} \right\}} - {{{lm}\left( {X_{i}\left( {n - {\left( {N - 1} \right)/2}} \right)} \right)}{g_{c}\left( {\left( {N - 1} \right)/2} \right)}}}}} \right) \right\rbrack$ ${{where}\mspace{14mu}{X_{i}(n)}\mspace{14mu}{is}\mspace{14mu}{the}\mspace{14mu}{input}\mspace{14mu}{signal}},{\left\{ {g(n)} \right\} = {\sum\limits_{m = 1}^{M}\;{w_{m}(n)}}},{n = {{0\text{:}N} - 1}},{\left\{ {w_{m}(n)} \right\} = \left\{ {{h_{m}(n)}{\mathbb{e}}^{j*2*p\;{\mathbb{i}}*{{fm} \cdot n}}} \right\}},{m = {1\text{:}M}}$ h_(m)(n) are symmetric baseband filters, one per carrier of said input signal, g_(c)(n) is a real part of g(n), real(g(n)), g_(s)(n) is an imaginary part of g(n), imag(g(n)), fm is a center frequency of the mth filter, and N is a number of taps in the filter.
 29. The computer program product of claim 28, wherein said gain factor is computed using a lookup table.
 30. The computer program product of claim 28, wherein A(n) is an approximation of said amplitude computed using a CORDIC (COordinate Rotation DIgital Computer) or other computing device. 